Iron arsenides with three-dimensional FeAs layer networks: Can(n+1)/2(Fe1−xPtx)(2+3n)Ptn(n−1)/2As(n+1)(n+2)/2 (n = 2, 3)
نویسندگان
چکیده
We report the comprehensive studies between synchrotron X-ray diffraction, electrical resistivity and magnetic susceptibility experiments for the iron arsenides Can(n+1)/2(Fe1-xPtx)(2+3n)Ptn(n-1)/2As(n+1)(n+2)/2 for n = 2 and 3. Both structures crystallize in the monoclinic space group P21/m (#11) with three-dimensional FeAs structures. The horizontal FeAs layers are bridged by inclined FeAs planes through edge-sharing FeAs5 square pyramids, resulting in triangular tunneling structures rather than the simple layered structures found in conventional iron arsenides. n = 3 system shows a sign of superconductivity with a small volume fraction. Our first-principles calculations of these systems clearly indicate that the Fermi surfaces originate from strong Fe-3d characters and the three-dimensional nature of the electric structures for both systems, thus offering the playgrounds to study the effects of dimensionality on high Tc superconductivity.
منابع مشابه
Square Designs on New Binary ( 3 n − 1 2 , 3 n − 1 2 , 2 . 3 n − 2 ) Codes
C is an (n,M, d)q code over Fq of length n with M codewords and minimum distance d. The code C can be either linear or nonlinear. A t − (v, k, λ) design D is a set X of v points together with a collection of k−subsets of X (called block) such that every t−subset of X is contained in exactly λ blocks. In this paper a new binary code ( n−1 2 , 3n−1 2 , 2.3 n−2), n ≥ 3 is developed. Some propertie...
متن کاملThe asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
Let RT (n), ED(n) and EOG(n) be the number of labelled regular tournaments, labelled loop-free simple Eulerian digraphs, and labelled Eulerian oriented simple graphs, respectively, on n vertices. Then, as n →∞, RT (n) = (2n+1 πn )(n−1)/2 n1/2e−1/2 ( 1 + O(n−1/2+ ) ) (n odd), ED(n) = ( 4 πn )(n−1)/2 n1/2e−1/4 ( 1 + O(n−1/2+ ) ) , and EOG(n) = (3n+1 4πn )(n−1)/2 n1/2e−3/8 ( 1 + O(n−1/2+ ) ) , for...
متن کاملEncoding Two-Dimensional Range Top-k Queries
We consider various encodings that support range Top-k queries on a two-dimensional array containing elements from a total order. For an m × n array, with m ≤ n, we first propose an almost optimal encoding for answering one-sided Top-k queries, whose query range is restricted to [1 . . .m][1 . . . a], for 1 ≤ a ≤ n. Next, we propose an encoding for the general Top-k queries that takes m2 lg ((k...
متن کاملMinimum degree condition for C4-tiling in 3-uniform hypergraphs
We show that there is n0 such that if H is a 3-uniform hypergraph on n ∈ 4Z, n ≥ n0, vertices such that δ1(H) ≥ ( n−1 2 ) − ( 3n/4 2 ) + 3n 8 + 1 2 , then H can be tiled with copies of C4, the unique 3-uniform hypergraph on four vertices with two edges. The degree condition is tight when 8|n.
متن کاملCharacterization results on small blocking sets
In [8], De Beule and Storme characterized the smallest blocking sets of the hyperbolic quadrics Q+(2n + 1, 3), n ≥ 4; they proved that these blocking sets are truncated cones over the unique ovoid of Q+(7, 3). We continue this research by classifying all the minimal blocking sets of the hyperbolic quadrics Q+(2n + 1, 3), n ≥ 3, of size at most 3n + 3n−2. This means that the three smallest minim...
متن کامل